Single-Source Shortest Paths with the Parallel Boost Graph Library
نویسندگان
چکیده
The Parallel Boost Graph Library (Parallel BGL) is a library of graph algorithms and data structures for distributed-memory computation on large graphs. Developed with the Generic Programming paradigm, the Parallel BGL is highly customizable, supporting various graph data structures, arbitrary vertex and edge properties, and different communication media. In this paper, we describe the implementation of two parallel variants of Dijkstra’s single-source shortest paths algorithm in the Parallel BGL. We also provide an experimental evaluation of these implementations using synthetic and real-world benchmark graphs from the 9 DIMACS Implementation Challenge.
منابع مشابه
Parallel Single-Source Shortest Paths
We designed and implemented a parallel algorithm for solving the single-source shortest paths (SSSP) problem for graphs with nonnegative edge weights, based on Gabow’s scaling algorithm for SSSP. This parallel Gabow algorithm attains a theoretical parallelism of Ω(E/(V lg∆ lgE/D)) in the worst case and Ω(E/(D lgV/D lgE/D lgDelta)with high probability on a random graph. In practice this algorith...
متن کاملOptimizing Dijkstra for real-world performance
Using Dijkstra’s algorithm to compute the shortest paths in a graph from a single source node to all other nodes is common practice in industry and academia. Although the original description of the algorithm advises using a Fibonacci Heap as its internal queue, it has been noted that in practice, a binary (or d-ary) heap implementation is significantly faster. This paper introduces an even fas...
متن کاملEfficient Parallel Algorithms for Planar st-Graphs1
Planar st-graphs find applications in a number of areas. In this paper we present efficient parallel algorithms for solving several fundamental problems on planar st-graphs. The problems we consider include all-pairs shortest paths in weighted planar st-graphs, single-source shortest paths in weighted planar layered digraphs (which can be reduced to single-source shortest paths in certain speci...
متن کاملDesign and analysis of sequential and parallel single-source shortest-paths algorithms
We study the performance of algorithms for the Single-Source Shortest-Paths (SSSP) problem on graphs with nodes and edges with nonnegative random weights. All previously known SSSP algorithms for directed graphs required superlinear time. We give the first SSSP algorithms that provably achieve linear average-case execution time on arbitrary directed graphs with random edge weights. For independ...
متن کاملParallel Delta-Stepping Algorithm for Shared Memory Architectures
We present a shared memory implementation of a parallel algorithm, called ∆-stepping, for solving the single source shortest path problem for directed and undirected graphs. In order to reduce synchronization costs we make some deviations from the algorithm and discuss the consequences. We study the behaviour of our implementation on smallworld and scale-free graphs, and graphs arising from gam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006